IRREDUCIBLE FACTORS OF THE q-LAH NUMBERS OVER Z
نویسنده
چکیده
In this paper, we first give a new q-analogue of the Lah numbers. Then we show the irreducible factors of the q-Lah numbers over Z.
منابع مشابه
Galois Theory, Elliptic Curves, and Root Numbers
The inverse problem of Galois theory asks whether an arbitrary finite group G can be realized as Gal(K/Q) for some Galois extension K of Q. When such a realization has been given for a particular G then a natural sequel is to find arithmetical realizations of the irreducible representations of G. One possibility is to ask for realizations in the Mordell-Weil groups of elliptic curves over Q: Gi...
متن کاملThe Irreducible Factorization of Fibonacci Polynomials
where a, b and (yn)n>o take values in some specified ring and a and b are fixed elements which do not depend on the Integer index n. A solution (yn)„^0 ^ completely specified once the values of yQ and yx are given. It is customary to denote by Fn(a, b) the solution corresponding to the choice y0 = 0, yt = l, and by Ln(a, b) the solution corresponding to the choice y0 = 2, yx = a. Loosely speaki...
متن کاملOn xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks
This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal ordering problem in the Weyl algebra W = 〈x,D|Dx − xD = 1〉. Any word ω ∈ W with m x’s and n D’s can be expressed in the normally ordered form ω = xm−n ∑ k>0 { ω k } xkDk, where { ω k } is known as the Stirling number of the second kind for the word ω. This study consid...
متن کاملDiophantine Approximation in Small Degree
Here, the exponent of q in the upper bound is optimal because, when ξ has bounded partial quotients, there is also a constant c > 0 such that |ξ − p/q| ≥ cq for all rational numbers p/q (see Chapter I of [14]). Define the height H(P ) of a polynomial P ∈ R[T ] as the largest absolute value of its coefficients, and the height H(α) of an algebraic number α as the height of its irreducible polynom...
متن کاملComputational experiences on the distances of polynomials to irreducible polynomials
In this paper we deal with a problem of Turán concerning the ‘distance’ of polynomials to irreducible polynomials. Using computational methods we prove that for any monic polynomial P ∈ Z[x] of degree ≤ 22 there exists a monic polynomial Q ∈ Z[x] with deg(Q) = deg(P ) such that Q is irreducible over Q and the ‘distance’ of P and Q is ≤ 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017